Quantum computational logic with mixed states
نویسندگان
چکیده
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a type quantum computational logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem.
منابع مشابه
Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملRepresenting continuous t-norms in quantum computation with mixed states
A model of quantum computation is discussed in (Aharanov et al 1997 Proc. 13th Annual ACM Symp. on Theory of Computation, STOC pp 20–30) and (Tarasov 2002 J. Phys. A: Math. Gen. 35 5207–35) in which quantum gates are represented by quantum operations acting on mixed states. It allows one to use a quantum computational model in which connectives of a four-valued logic can be realized as quantum ...
متن کاملQuantum automata with mixed states; functions and languages recognition
In this work we consider the aspect of computational complexity called oracle query complexity, that is number of queries one needs to ask oracle to compute Boolean function We show two computational models: pure states quantum automata and quantum automata with mixed states. We present a function, that can be computed by quantum automata with mixed states with fewer queries than by pure states...
متن کاملMeasurement - based quantum computation and undecidable logic
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 59 شماره
صفحات -
تاریخ انتشار 2013